Epistemic Equilibrium Logic

نویسندگان

  • Luis Fariñas del Cerro
  • Andreas Herzig
  • Ezgi Iraz Su
چکیده

We add epistemic modal operators to the language of here-and-there logic and define epistemic hereand-there models. We then successively define epistemic equilibrium models and autoepistemic equilibrium models. The former are obtained from here-and-there models by the standard minimisation of truth of Pearce’s equilibrium logic; they provide an epistemic extension of that logic. The latter are obtained from the former by maximising the set of epistemic possibilities; they provide a new semantics for Gelfond’s epistemic specifications. For both definitions we characterise strong equivalence by means of logical equivalence in epistemic hereand-there logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nested Epistemic Logic Programs

Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarely explored. In this paper we first introduce the epistemic HT-logic, and then propose a more general extension of logic programs called nested epistemic logic programs. The semantics of this extension named equilibrium views is...

متن کامل

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences all together

We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and enabling to reason about epistemic games in strategic form. We provide complexity results for EDLA. In the second part of the paper, we study in EDLA the epistemic and rationality conditions of some classical solution con...

متن کامل

Dynamic Epistemic Characterizations for IERS

The iterated regret minimization solution exhibits the good qualitative behavior as that observed in experiments in many games that have proved problematic for Nash Equilibrium(NE). It is worthy exploring epistemic characterizations unearthing players’rationality for an algorithm of Iterated Eliminations Regret-dominated Strategy (IERS) related to the solution. In this paper, based on the dynam...

متن کامل

A Modal Logic of Epistemic Games

We propose some variants of a multi-modal logic of joint action, preference and knowledge that support reasoning about epistemic games in strategic form. The first part of the paper deals with games with complete information. We first provide syntactic proofs of some theorems that are well-known in the area of interactive epistemology and that specify some sufficient epistemic conditions of equ...

متن کامل

Stable Models in Generalized Possibilistic Logic

Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, taken from a totally ordered, but essentially qualitative scale. Recently, a generalization has been proposed that extends possibilistic logic to a meta-epistemic logic, endowing it ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015